Reminiscences about Difference Schemes

نویسنده

  • Sergei Konstantinovich Godunov
چکیده

In these notes, I will tell how in 1953–1954 the first version of the “Godunov’s scheme” was invented and how it was modified in the subsequent works by myself (until 1969) and by others at the Institute of Applied Mathematics in Moscow (now named after its founder, academician M. V. Keldish). Parallel to the modifications which I will describe below (Sections 1, 2), other algorithms were being developed as well at that time, in particular second-order accurate methods for gas-dynamical flows with a small number of strong and weak discontinuities [1, 27, 26]. Our research activity was related to performing a large number of calculations. The first codes for this purpose were written by V. V. Lucikovich. As the problems became more complex, more artful techniques were required for splitting the computational domain into sub-domains. A. V. Zabrodin was a master in this field. Usage of such splitting techniques lead to the necessity to make the grid generation automatic. Between 1961 and 1968, together with G. P. Prokopov, we worked long and hard on the methodology for the generation of moving grids, which in 1968–1969 were included into the commercial codes by A. V. Zabrodin and programmers G. M. Novozhilova and G. B. Alalikin [39, 13, 31]. The problems that arose in the grid generation focused our attention on the solution of elliptic systems [20, 38]. Later these methods were used in elliptic spectral problems [30, 21], which attracted my attention to the problems of numerical linear algebra. A whole host of surprising observations made at that time provided a source of seminar discussions at Moscow University and, after 1969, at Novosibirsk University for years to come. These discussions resulted in the development of spectral dichotomy methods [18, 16]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reminiscences about numerical schemes

This preprint appeared firstly in Russian in 1997. Some truncated versions of this preprint were published in English and French, here a fully translated version is presented. The translation in English was done by O. V. Feodoritova and V. Deledicque to whom I express my gratitude. Key-words: Godunov’s Scheme, hyperbolic systems of conservation laws. ∗ Sobolev Institute of Mathematics, Novosibi...

متن کامل

APPROXIMATION OF STOCHASTIC PARABOLIC DIFFERENTIAL EQUATIONS WITH TWO DIFFERENT FINITE DIFFERENCE SCHEMES

We focus on the use of two stable and accurate explicit finite difference schemes in order to approximate the solution of stochastic partial differential equations of It¨o type, in particular, parabolic equations. The main properties of these deterministic difference methods, i.e., convergence, consistency, and stability, are separately developed for the stochastic cases.

متن کامل

Nonstandard finite difference schemes for differential equations

In this paper, the reorganization of the denominator of the discrete derivative and nonlocal approximation of nonlinear terms are used in the design of nonstandard finite difference schemes (NSFDs). Numerical examples confirming then efficiency of schemes, for some differential equations are provided. In order to illustrate the accuracy of the new NSFDs, the numerical results are compared with ...

متن کامل

Reminiscences of the VLSI Revolution

th anniversary of launching her VLSI design course there. Preface Innovations in science and engineering have excited me for a lifetime, as they have for many friends and colleagues. Unfortunately, our wider culture often imagines the engineering life to be one of tedium and technical drudgery, seldom witnessing the joys of such creativity. If only I could wave a wand, I've often wished, and sa...

متن کامل

Solving a system of 2D Burgers' equations using Semi-Lagrangian finite difference schemes

In this paper, we aim to generalize semi-Lagrangian finite difference schemes for a system of two-dimensional (2D) Burgers' equations. Our scheme is not limited by the Courant-Friedrichs-Lewy (CFL) condition and therefore we can apply larger step size for the time variable. Proposed schemes can be implemented in parallel very well and in fact, it is a local one-dimensional (LOD) scheme which o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998